Clustering algorithms for intelligent web
نویسندگان
چکیده
منابع مشابه
Clustering with Intelligent Linexk-Means
The intelligent LINEX k-means clustering is a generalization of the k-means clustering so that the number of clusters and their related centroid can be determined while the LINEX loss function is considered as the dissimilarity measure. Therefore, the selection of the centers in each cluster is not randomly. Choosing the LINEX dissimilarity measure helps the researcher to overestimate or undere...
متن کاملTopicSearch - Personalized Web Clustering Engine Using Semantic Query Expansion, Memetic Algorithms and Intelligent Agents
As resources become more and more available on the Web, so the difficulties associated with finding the desired information increase. Intelligent agents can assist users in this task since they can search, filter and organize information on behalf of their users. Web document clustering techniques can also help users to find pages that meet their information requirements. This paper presents a ...
متن کاملAdvanced Web Image Retrieval Using Clustering Algorithms
In this paper we propose a novel methodology for Web Image retrieval system that takes an image as the input query and retrieves images based on image content. Content Based Image Retrieval is an approach for retrieving semantically-relevant images from an image store based on algorithmically-derived image features. We propose an algorithm to represent images using divisive and partitioned base...
متن کاملAn Analysis of Web Document Clustering Algorithms
Evidently there is a tremendous increase in the amount of information found today on the largest shared information source, the World Wide Web. The process of finding relevant information on the web is overwhelming. Even with the presence of today’s search engines that index the web it is difficult to wade through the large number of returned documents in a response to a user query. Furthermore...
متن کاملLow-complexity fuzzy relational clustering algorithms for Web mining
This paper presents new algorithms (Fuzzy c-Medoids or FCMdd and Robust Fuzzy c-Medoids or RFCMdd) for fuzzy clustering of relational data. The objective functions are based on selecting c representative objects (medoids) from the data set in such a way that the total fuzzy dissimilarity within each cluster is minimized. A comparison of FCMdd with the well-known Relational Fuzzy c-Means algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Complexity and Intelligent Algorithms
سال: 2016
ISSN: 2048-4720,2048-4739
DOI: 10.1504/ijccia.2016.077462